Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
نویسندگان
چکیده
منابع مشابه
Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of pri...
متن کاملAdjustable Robust Multistage Optimization
Format (5.1.1) covers all uncertain optimization problems considered so far; moreover, in these latter problems the objective f and the right hand side F of the constraints always were bi-affine in x, ζ, (that is, affine in x when ζ is fixed, and affine in ζ, x being fixed), and K was a “simple” convex cone (a direct product of nonnegative rays/Lorentz cones/Semidefinite cones, depending on whe...
متن کاملMultistage Robust Mixed-Integer Optimization with Adaptive Partitions
We present a new partition-and-bound method for multistage adaptive mixed integer optimization (AMIO) problems that extends previous work on finite adaptability. The approach analyzes the optimal solution to a static (non-adaptive) version of an AMIO problem to gain insight into which regions of the uncertainty set are restricting the objective function value. We use this information to constru...
متن کاملOn the approximability of adjustable robust convex optimization under uncertainty
In this paper, we consider adjustable robust versions of convex optimization problems with uncertain constraints and objectives and show that under fairly general assumptions, a static robust solution provides a good approximation for these adjustable robust problems. An adjustable robust optimization problem is usually intractable since it requires to compute a solution for all possible realiz...
متن کاملAdjustable Robust Optimization via Fourier-Motzkin Elimination
We demonstrate how adjustable robust optimization (ARO) problems with fixed recourse can be casted as static robust optimization problems via Fourier-Motzkin elimination (FME). Through the lens of FME, we characterize the structures of the optimal decision rules for a broad class of ARO problems. A scheme based on a blending of classical FME and a simple Linear Programming technique that can ef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2016
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.2016.0696